{2,3}-Extraconnectivities of hypercube-like networks

Edge-fault tolerance of hypercube-like networks

A Class of Hypercube-Like Networks

W e introduce a class of graphs which are variants of t h e hypercube graph. M a n y of the properties of this class of graphs are s imilar t o tha t of the hypercube hence, we refer t o t h e m as t h e class of Hypercube-Like ( H L ) graphs/networks. W e show that the hypercube, t h e twisted n-cube [l] and the multiply-twisted cube [2] are members of this class of graphs. W e also propose s ...

Extra edge connectivity of hypercube-like networks

Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opin...

Conditional matching preclusion for hypercube-like interconnection networks

The conditional matching preclusion number of a graph with n vertices is the minimum number of edges whose deletion results in a graph without an isolated vertex that does not have a perfect matching if n is even, or an almost perfect matching if n is odd. We develop some general properties on conditional matching preclusion and then analyze the conditional matching preclusion numbers for some ...

The spanning laceability on the faulty bipartite hypercube-like networks

a Institute of Information Science, Academia Sinica, Taipei City 11529, Taiwan, ROC Department of Computer Science and Information Engineering, Hungkuang University, Taichung City 433, Taiwan, ROC Department of Computer Science, National Chiao Tung University, Hsinchu 30010, Taiwan, ROC Department of Computer Science and Information Engineering, Providence University, Taichung City 433, Taiwan,...